Some Properties of Invers Resolution in Normal Logic Programs

نویسنده

  • Chiaki Sakama
چکیده

This paper studies the properties of inverse resolution in normal logic programs. The V-operators are known as operations for inductive generalization in definite logic programs. In the presence of negation as failure in a program, however, the V-operators do not work as generalization operations in general and often make a consistent program inconsistent. Moreover, they may destroy the syntactic structure of logic programs such as acyclicity and local stratification. On the procedural side, unrestricted application of the V-operators may lose answers computed in the original program and make queries flounder. We provide sufficient conditions for the V-operators to avoid these problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Modal Logic Programming System MProlog: Theory, Design, and Implementation

We present a general framework for developing fixpoint semantics, the least model semantics, and SLD-resolution calculi for logic programs in normal multimodal logics whose frame restrictions consist of the conditions of seriality (i.e. ∀x ∃y Ri(x, y)) and some classical firstorder Horn formulas. Our approach is direct and no special restriction on occurrences of 2i and 3i is assumed. We prove ...

متن کامل

Declarative and Operational Semantics for Bilattice-based Annotated Logic Programs

We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. Thus, we discuss properties of the associated immediate consequence operators and establish their fixed-point theory. In addition, SLD-resolution for these programs is defined and its soundness and completeness established.

متن کامل

Properties of Translations for Logic Programs

We present a study of some properties of program translations in the context of logic programming. In particular we provide, under the answer set semantics, a translation for arbitrary propositional theories into the simple class of disjunctive programs. We also show how syntactic and semantic properties of translations can be related. The work follows a line of research that applies mathematic...

متن کامل

Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities

We study logic programs with arbitrary abstract constraint atoms, called c-atoms. As a theoretical means to analyze program properties, we investigate the possibility of unfolding these programs to logic programs composed of ordinary atoms. This approach reveals some structural properties of a program with catoms, and enables characterization of these properties based on the known properties of...

متن کامل

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols

We study the recognition problem in the metaprogramming of finite normal predicate logic programs. That is, let L be a computable first order predicate language with infinitely many constant symbols and infinitely many n-ary predicate symbols and n-ary function symbols for all n ≥ 1. Then we can effectively list all the finite normal predicate logic programs Q0, Q1, . . . over L. Given some pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999